Limits of cubes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyper-tubes of hyper-cubes

Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

متن کامل

Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes

If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...

متن کامل

Rep-cubes: Unfolding and Dissection of Cubes

Last year, a new notion of rep-cube was proposed. A rep-cube is a polyomino that is a net of a cube, and it can be divided into some polyominoes such that each of them can be folded to a cube. This notion was inspired by the notions of polyomino and rep-tile, which were introduced by Solomon W. Golomb. It was proved that there are infinitely many distinct rep-cubes. In this paper, we investigat...

متن کامل

Limits in modified categories of interest

‎We firstly prove the completeness of the category of crossed modules in a modified category of interest‎. ‎Afterwards‎, ‎we define pullback crossed modules and pullback cat objects that are both obtained by pullback diagrams with extra structures on certain arrows‎. ‎These constructions unify many corresponding results for the cases of groups‎, ‎commutative algebras and can also be adapted to ...

متن کامل

Paths in Möbius cubes and crossed cubes

The Möbius cube MQn and the crossed cube CQn are two important variants of the hypercube Qn. This paper shows that for any two different vertices u and v in G ∈ {MQn,CQn} with n 3, there exists a uv-path of every length from dG(u, v)+ 2 to 2n − 1 except for a shortest uv-path, where dG(u, v) is the distance between u and v in G. This result improves some known results.  2005 Elsevier B.V. All ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2008

ISSN: 0166-8641

DOI: 10.1016/j.topol.2008.03.022